Crossing minimization in perturbed drawings
نویسندگان
چکیده
منابع مشابه
Crossing minimization in extended level drawings of graphs
The most popular method of drawing directed graphs is to place vertices on a set of horizontal or concentric levels, known as level drawings. Level drawings are well studied in Graph Drawing due to their strong application for the visualization of hierarchy in graphs. There are two drawing conventions: horizontal drawings use a set of parallel lines and radial drawings use a set of concentric c...
متن کاملCrossing Minimization within Graph Embeddings Crossing Minimization within Graph Embeddings
We propose a novel optimization-based approach to embedding heterogeneous high-dimensional data characterized by a graph. The goal is to create a two-dimensional visualization of the graph structure such that edge-crossings are minimized while preserving proximity relations between nodes. This paper provides a fundamentally new approach for addressing the crossing minimization criteria that exp...
متن کاملCrossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
We investigate crossing minimization for 1-page and 2-page book drawings. We show that computing the 1-page crossing number is fixed-parameter tractable with respect to the number of crossings, that testing 2-page planarity is fixed-parameter tractable with respect to treewidth, and that computing the 2-page crossing number is fixed-parameter tractable with respect to the sum of the number of c...
متن کاملCrossing Minimization in Storyline Visualization
A storyline visualization is a layout that represents the temporal dynamics of social interactions along time by the convergence of chronological lines. Among the criteria oriented at improving aesthetics and legibility of a representation of this type, a small number of line crossings is the hardest to achieve. We model the crossing minimization in the storyline visualization problem as a mult...
متن کاملRectilinear Crossing Minimization
This thesis deals with the rectilinear crossing minimization problem, which is NP-hard [BD93]. More precisely, we propose a heuristic for computing a straight-line drawing of a general graph G which realizes a small rectilinear crossing number. Inspired by Gutwenger et al. [GMW05], we pursue an approach which extracts a planar subgraph that includes as many edges of G as possible and iterativel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2020
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-020-00586-0